Testing Odd-Cycle-Freeness in Boolean Functions
نویسندگان
چکیده
منابع مشابه
Testing odd-cycle-freeness in Boolean functions
Call a function f : F 2 → {0, 1} odd-cycle-free if there are no x1, . . . , xk ∈ Fn2 with k an odd integer such that f(x1) = · · · = f(xk) = 1 and x1 + · · · + xk = 0. We show that one can distinguish odd-cycle-free functions from those ǫ-far from being odd-cycle-free by making poly(1/ǫ) queries to an evaluation oracle. To obtain this result, we use connections between basic Fourier analysis an...
متن کاملDistributedly Testing Cycle-Freeness
We tackle local distributed testing of graph properties. This framework is well suited to contexts in which data dispersed among the nodes of a network can be collected by some central authority (like in, e.g., sensor networks). In local distributed testing, each node can provide the central authority with just a few information about what it perceives from its neighboring environment, and, bas...
متن کاملImproved Lower Bounds for Testing Triangle-freeness in Boolean Functions via Fast Matrix Multiplication
Understanding the query complexity for testing linear-invariant properties has been a central open problem in the study of algebraic property testing. Triangle-freeness in Boolean functions is a simple property whose testing complexity is unknown. Three Boolean functions f1, f2 and f3 : F2 → {0, 1} are said to be triangle free if there is no x, y ∈ F2 such that f1(x) = f2(y) = f3(x + y) = 1. Th...
متن کاملTesting cycle-freeness: Finding a certificate
We deal with the problem of designing one-sided error property testers for cycle-freeness in bounded degree graphs. Such a property tester always accepts forests. Furthermore, when it rejects an input, it provides a short cycle as a certificate. The problem of testing cycle-freeness in this model was first considered by Goldreich and Ron [13]. They give a constant time tester with two-sided err...
متن کاملTesting Properties of Boolean Functions
Given oracle access to some boolean function f, how many queries do we need to test whether f is linear? Or monotone? Or whether its output is completely determined by a small number of the input variables? This thesis studies these and related questions in the framework of property testing introduced by Rubinfeld and Sudan (’96). The results of this thesis are grouped into three main lines of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorics, Probability and Computing
سال: 2012
ISSN: 0963-5483,1469-2163
DOI: 10.1017/s0963548312000363